Average entropy of a subsystem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average entropy of a subsystem.

If a quantum system of Hilbert space dimension mn is in a random pure state, the average entropy of a subsystem of dimension m ≤ n is conjectured to be S m,n = mn k=n+1 1 k − m−1 2n and is shown to be ≃ ln m − m 2n for 1 ≪ m ≤ n. Thus there is less than one-half unit of information, on average, in the smaller subsystem of a total system in a random pure state.

متن کامل

Subsystem Entropy Exceeding Bekenstein's Bound *

If Bekenstein's conjectured bound on the microcanonical entropy, S ≤ 2πER, is applied to a closed subsystem of maximal linear size R and excitation energy up through E, it can be violated by an arbitrarily large factor by a scalar field having a symmetric potential allowing domain walls, and by the electromagnetic field modes in a coaxial cable.

متن کامل

A Novel ACO with Average Entropy

In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the modification is to measure the uncertainty of the path selection and evolution by using the average information entropy self-adaptively. Simulation study and performance comparison on Traveling Salesman Problem show t...

متن کامل

Novel Entropy based moving average

The training of precise speech recognition models depends on accurate segmentation of the phonemes in a training corpus. Segmentation is typically performed using HMMs, but recent speech recognition work suggests that the transient acoustic features characteristic of manner-class phoneme boundaries (landmarks) may be more precisely localized using acoustic classifiers specifically designed for ...

متن کامل

Entropy and Average Cost of AUH Codes

In this paper we address the class of anti-uniform Huffman (AUH) codes, named also unary codes, for sources with finite and infinite alphabet, respectively. Geometric, quasi-geometric, Fibonacci, exponential, Poisson, and negative binomial distributions lead to anti – uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 1993

ISSN: 0031-9007

DOI: 10.1103/physrevlett.71.1291